The $t$-Pebbling Number is Eventually Linear in $t$
نویسندگان
چکیده
منابع مشابه
The t-Pebbling Number is Eventually Linear in t
In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The t-pebbling number πt(G) of a graph G is the smallest m such that for every initial distribution of m pebbles on V (G) and every target vertex x there exists a sequence of pebbling moves leading t...
متن کاملt-Pebbling Number of Some Multipartite Graphs
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent to v. A graph is called pebbleable if for each vertex v there is a sequence of pebbling moves that would place at least one pebble on v. The pebbling number of a graph G, is the smallest integer m such that G is pebblea...
متن کاملt-Pebbling and Extensions
We give upper bounds on t-pebbling numbers of graphs of small diameter and investigate the relationships between these results and those relating to fractional pebbling. Furthermore, we present a connection between optimal pebbling and linear optimization and utilize this relationship in analyzing various graphs. We introduce the optimal fractional pebbling number of a graph and provide a combi...
متن کاملThe 2 t - Pebbling Property on the Jahangir Graph
The t-pebbling number, ft(G), of a connected graph G, is the smallest positive integer such that from every placement of ft(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move taking two pebbles off a vertex and placing one on an adjacent vertex. A graph G satisfies the 2t-pebbling property if 2t pebbles can be moved to a specified vertex...
متن کاملDetermination of the number of components in finite mixture distribution with Skew-t-Normal components
Abstract One of the main goal in the mixture distributions is to determine the number of components. There are different methods for determination the number of components, for example, Greedy-EM algorithm which is based on adding a new component to the model until satisfied the best number of components. The second method is based on maximum entropy and finally the third method is based on non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2011
ISSN: 1077-8926
DOI: 10.37236/640